Double coset density in classical algebraic groups
نویسندگان
چکیده
منابع مشابه
Infiniteness of Double Coset Collections in Algebraic Groups
Let G be a linear algebraic group defined over an algebraically closed field. The double coset question addressed in this paper is the following: Given closed subgroups X and P , is X\G/P finite or infinite? We limit ourselves to the case where X is maximal rank and reductive and P parabolic. This paper presents a criterion for infiniteness which involves only dimensions of centralizers of semi...
متن کاملCoset and double-coset decompositions of the magnetic point groups.
The coset and double-coset decompositions of the 420 subgroups of m(z)3(xyz)m(xy)1' (O(h)1') and the 236 subgroups of 6(z)/m(z)m(x)m(1)1' (D(6h)1') with respect to each of their subgroups are calculated along with additional mathematical properties of these groups.
متن کاملA Classification of Certain Finite Double Coset Collections in the Classical Groups
Let G be a classical algebraic group, X a maximal rank reductive subgroup and P a parabolic subgroup. This paper classifies when X\G/P is finite. Finiteness is proven using geometric arguments about the action of X on subspaces of the natural module for G. Infiniteness is proven using a dimension criterion which involves root systems. 1 Statement of results Let G be a classical algebraic group ...
متن کاملDouble Coset Decompositions and Computational Harmonic Analysis on Groups
In this paper we introduce new techniques for the eecient computation of a Fourier transform on a nite group. We use the decomposition of a group into double cosets and a graph theoretic indexing scheme to derive algorithms that generalize the Cooley-Tukey FFT to arbitrary nite groups. We apply our general results to special linear groups and low rank symmetric groups, and obtain new eecient al...
متن کاملDouble-coset enumeration algorithm for symmetrically generated groups
The Todd-Coxeter algorithm described in [13] remains a primary reference for coset enumeration programs. It may be viewed as a means of constructing permutation representations of finitely presented groups. A number of effective computer programs for singlecoset enumeration have been described, see, for example, [2, 7, 8]. Enumerating double cosets, rather than single cosets, gives substantial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1999
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-99-02258-8